#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

void solve() {
    int n,k;
    cin>>n>>k;

    V<int>w(n+1);

    FOR(i,1,n)cin>>w[i];

    int mx=*max_element(w.begin()+1,w.end());
    map<int,V<int>>mp;
    
    FOR(i,1,n){
        mp[w[i]].eb(i);
    }

    int ans=0;

    FOR(i,2,n-1){
        int t=w[i];
        int l=w[i]/k,r=w[i]*k;
        if(w[i]%k!=0||w[i]*k>mx)continue;
        int cl=upper_bound(ALL(mp[l]),i-1)-mp[l].begin()-1;
        int cr=lower_bound(ALL(mp[r]),i+1)-mp[r].begin();
        cl=cl+1,cr=mp[r].sz-cr;
        // cout<<cl<<' '<<cr<<endl;
        ans+=(cl*cr);
    }

    cout<<ans;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}